Optimizing data compression in a storage system

ABSTRACT

Compressing data in dependence upon characteristics of a storage system, including: receiving an amount of processing resources available in the storage system; receiving an amount of space available in the storage system; and selecting, in dependence upon the priority for conserving the amount of processing resources and the amount of space, a data compression algorithm to utilize to compress the data.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation application of and claims priority from U.S. patent application Ser. No. 15/041,307, filed on Feb. 11, 2016, which is now U.S. Pat. No. 10,572,460 issued Feb. 25, 2020.

BACKGROUND Technical Field

The field of the disclosure is data processing, or, more specifically, methods, apparatus, and products for compressing data in dependence upon characteristics of a storage system.

Background Art

Enterprise storage systems frequently include a plurality of storage devices. Each of the storage devices may be capable of storing a particular amount of data, and as such, the storage system as a whole is characterized by the cumulative capacity of the storage devices that make up the storage system. In order to better utilize the capacity of the storage system, data reduction techniques are often applied to reduce the size of the data stored in the storage system. One such technique is data compression. Data compression, however, is frequently carried out in an unsophisticated, non-optimal manner.

SUMMARY OF INVENTION

Methods, apparatuses, and products for compressing data in dependence upon characteristics of a storage system, including: receiving an amount of processing resources available in the storage system; receiving an amount of space available in the storage system; and selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm to utilize to compress the data.

The foregoing and other objects, features and advantages of the disclosure will be apparent from the following more particular descriptions of example embodiments of the disclosure as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of example embodiments of the disclosure.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 sets forth a block diagram of a storage system configured for compressing data in dependence upon characteristics of the storage system according to embodiments of the present disclosure.

FIG. 2 sets forth a block diagram of a storage array controller useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 4 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 5 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 6 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 7 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 8 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

FIG. 9 sets forth a flow chart illustrating a further example method for compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

DESCRIPTION OF EMBODIMENTS

Example methods, apparatuses, and products for compressing data in dependence upon characteristics of a storage system in accordance with the present disclosure are described with reference to the accompanying drawings, beginning with FIG. 1. FIG. 1 sets forth a block diagram of a storage system configured for compressing data in dependence upon characteristics of the storage system according to embodiments of the present disclosure. The storage system of FIG. 1 includes a number of computing devices (164, 166, 168, 170). Such computing devices may be implemented in a number of different ways. For example, a computing device may be a server in a data center, a workstation, a personal computer, a notebook, or the like.

The computing devices (164, 166, 168, 170) in the example of FIG. 1 are coupled for data communications to a number of storage arrays (102, 104) through a storage area network (SAN′) (158) as well as a local area network (160) (‘LAN’). The SAN (158) may be implemented with a variety of data communications fabrics, devices, and protocols. Example fabrics for such a SAN (158) may include Fibre Channel, Ethernet, Infiniband, Serial Attached Small Computer System Interface (‘SAS’), and the like. Example data communications protocols for use in such a SAN (158) may include Advanced Technology Attachment (‘ATA’), Fibre Channel Protocol, SCSI, iSCSI, HyperSCSI, and others. Readers of skill in the art will recognize that a SAN is just one among many possible data communications couplings which may be implemented between a computing device (164, 166, 168, 170) and a storage array (102, 104). For example, the storage devices (146, 150) within the storage arrays (102, 104) may also be coupled to the computing devices (164, 166, 168, 170) as network attached storage (‘NAS’) capable of facilitating file-level access, or even using a SAN-NAS hybrid that offers both file-level protocols and block-level protocols from the same system. Any other such data communications coupling is well within the scope of embodiments of the present disclosure.

The local area network (160) of FIG. 1 may also be implemented with a variety of fabrics and protocols. Examples of such fabrics include Ethernet (802.3), wireless (802.11), and the like. Examples of such data communications protocols include Transmission Control Protocol (TCP′), User Datagram Protocol (‘UDP’), Internet Protocol (‘IP’), HyperText Transfer Protocol (‘HTTP’), Wireless Access Protocol (‘WAP’), Handheld Device Transport Protocol (‘HDTP’), Real Time Protocol (‘RTP’) and others as will occur to those of skill in the art.

The example storage arrays (102, 104) of FIG. 1 provide persistent data storage for the computing devices (164, 166, 168, 170). Each storage array (102, 104) depicted in FIG. 1 includes a storage array controller (106, 112). Each storage array controller (106, 112) may be embodied as a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software. The storage array controllers (106, 112) may be configured to carry out various storage-related tasks. Such tasks may include writing data received from the one or more of the computing devices (164, 166, 168, 170) to storage, erasing data from storage, retrieving data from storage to provide the data to one or more of the computing devices (164, 166, 168, 170), monitoring and reporting of disk utilization and performance, performing RAID (Redundant Array of Independent Drives) or RAID-like data redundancy operations, compressing data, encrypting data, and so on.

Each storage array controller (106, 112) may be implemented in a variety of ways, including as a Field Programmable Gate Array (‘FPGA’), a Programmable Logic Chip (‘PLC’), an Application Specific Integrated Circuit (‘ASIC’), or computing device that includes discrete components such as a central processing unit, computer memory, and various adapters. Each storage array controller (106, 112) may include, for example, a data communications adapter configured to support communications via the SAN (158) and the LAN (160). Although only one of the storage array controllers (112) in the example of FIG. 1 is depicted as being coupled to the LAN (160) for data communications, readers will appreciate that both storage array controllers (106, 112) may be independently coupled to the LAN (160). Each storage array controller (106, 112) may also include, for example, an I/O controller or the like that couples the storage array controller (106, 112) for data communications, through a midplane (114), to a number of storage devices (146, 150), and a number of write buffer devices (148, 152).

Each write buffer device (148, 152) may be configured to receive, from the storage array controller (106, 112), data to be stored in the storage devices (146). Such data may originate from any one of the computing devices (164, 166, 168, 170). In the example of FIG. 1, writing data to the write buffer device (148, 152) may be carried out more quickly than writing data to the storage device (146, 150). The storage array controller (106, 112) may be configured to effectively utilize the write buffer devices (148, 152) as a quickly accessible buffer for data destined to be written to storage. In this way, the latency of write requests may be significantly improved relative to a system in which the storage array controller writes data directly to the storage devices (146, 150).

A ‘storage device’ as the term is used in this specification refers to any device configured to record data persistently. The term ‘persistently’ as used here refers to a device's ability to maintain recorded data after loss of a power source. Examples of storage devices may include mechanical, spinning hard disk drives, Solid-state drives (e.g., “Flash drives”), and the like.

The storage array controllers (106, 112) of FIG. 1 may be useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure. The storage array controllers (106, 112) may assist in intelligently compressing data by receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting a data compression algorithm to utilize to compress the data in dependence upon a priority for conserving the amount of processing resources and the amount of space, and performing other functions as will be described in greater detail below.

The arrangement of computing devices, storage arrays, networks, and other devices making up the example system illustrated in FIG. 1 are for explanation, not for limitation. Systems useful according to various embodiments of the present disclosure may include different configurations of servers, routers, switches, computing devices, and network architectures, not shown in FIG. 1, as will occur to those of skill in the art.

Compressing data in dependence upon characteristics of a storage system in accordance with embodiments of the present disclosure is generally implemented with computers. In the system of FIG. 1, for example, all the computing devices (164, 166, 168, 170) and storage controllers (106, 112) may be implemented to some extent at least as computers. For further explanation, therefore, FIG. 2 sets forth a block diagram of a storage array controller (202) useful in compressing data in dependence upon characteristics of a storage system according to embodiments of the present disclosure.

The storage array controller (202) of FIG. 2 is similar to the storage array controllers depicted in FIG. 1, as the storage array controller (202) of FIG. 2 is communicatively coupled, via a midplane (206), to one or more storage devices (212) and to one or more memory buffer devices (214) that are included as part of a storage array (216). The storage array controller (202) may be coupled to the midplane (206) via one or more data communications links (204) and the midplane (206) may be coupled to the storage devices (212) and the memory buffer devices (214) via one or more data communications links (208, 210). The data communications links (204, 208, 210) of FIG. 2 may be embodied, for example, as Peripheral Component Interconnect Express (‘PCIe’) bus.

The storage array controller (202) of FIG. 2 includes at least one computer processor (232) or ‘CPU’ as well as random access memory (‘RAM’) (236). The computer processor (232) may be connected to the RAM (236) via a data communications link (230), which may be embodied as a high speed memory bus such as a Double-Data Rate 4 (‘DDR4’) bus.

Stored in RAM (214) is an operating system (246). Examples of operating systems useful in storage array controllers (202) configured for intelligently compressing data in a storage array according to embodiments of the present disclosure include UNIX™, Linux™, Microsoft Windows™, and others as will occur to those of skill in the art. Also stored in RAM (236) is a compression optimization module (248), a module that includes computer program instructions useful in compressing data in dependence upon characteristics of a storage system that includes a plurality of storage devices according to embodiments of the present disclosure.

The compression optimization module (248) may compress data in dependence upon characteristics of a storage system by: receiving an amount of processing resources available in the storage system, receiving an amount of space available in the storage system, and selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm to utilize to compress the data, as will be described in greater detail below.

The compression optimization module (248) may further intelligently compress data in a storage array that includes a plurality of storage devices by: determining an expected amount of space in the storage system to be consumed within a predetermined period of time, determining an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm for each of a plurality of data compression algorithms, determining, an expected decompression speed associated with decompressing the data for each of a plurality of data compression algorithms, determining an average decompression speed associated with decompressing a pool of data for each of a plurality of data compression algorithms, compressing at least a portion of the data utilizing a plurality of data compression algorithms, identifying a data reduction level achieved by each data compression algorithm, determining a decompression speed associated with each data compression algorithm, and selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm, as will be described in greater detail below.

The storage array controller (202) of FIG. 2 also includes a plurality of host bus adapters (218, 220, 222) that are coupled to the processor (232) via a data communications link (224, 226, 228). Each host bus adapter (218, 220, 222) may be embodied as a module of computer hardware that connects the host system (i.e., the storage array controller) to other network and storage devices. Each of the host bus adapters (218, 220, 222) of FIG. 2 may be embodied, for example, as a Fibre Channel adapter that enables the storage array controller (202) to connect to a SAN, as an Ethernet adapter that enables the storage array controller (202) to connect to a LAN, and so on. Each of the host bus adapters (218, 220, 222) may be coupled to the computer processor (232) via a data communications link (224, 226, 228) such as, for example, a PCIe bus.

The storage array controller (202) of FIG. 2 also includes a host bus adapter (240) that is coupled to an expander (242). The expander (242) depicted in FIG. 2 may be embodied as a module of computer hardware utilized to attach a host system to a larger number of storage devices than would be possible without the expander (242). The expander (242) depicted in FIG. 2 may be embodied, for example, as a SAS expander utilized to enable the host bus adapter (240) to attach to storage devices in an embodiment where the host bus adapter (240) is embodied as a SAS controller.

The storage array controller (202) of FIG. 2 also includes a switch (244) that is coupled to the computer processor (232) via a data communications link (238). The switch (244) of FIG. 2 may be embodied as a computer hardware device that can create multiple endpoints out of a single endpoint, thereby enabling multiple devices to share what was initially a single endpoint. The switch (244) of FIG. 2 may be embodied, for example, as a PCIe switch that is coupled to a PCIe bus (238) and presents multiple PCIe connection points to the midplane (206).

The storage array controller (202) of FIG. 2 also includes a data communications link (234) for coupling the storage array controller (202) to other storage array controllers. Such a data communications link (234) may be embodied, for example, as a QuickPath Interconnect (‘QPI’) interconnect, as PCIe non-transparent bridge (‘NTB’) interconnect, and so on.

Readers will recognize that these components, protocols, adapters, and architectures are for illustration only, not limitation. Such a storage array controller may be implemented in a variety of different ways, each of which is well within the scope of the present disclosure.

For further explanation, FIG. 3 sets forth a flow chart illustrating an example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. Although depicted in less detail, the storage system (300) of FIG. 3 may be similar to the storage arrays described above with reference to FIG. 1. The storage system (300) of FIG. 3 includes a plurality of storage devices (302, 304, 306), each of which may be used to store data (308, 310, 312).

The example method depicted in FIG. 3 is carried out, at least in part, by a compression prioritization module (314). The compression prioritization module (314) may be embodied, for example, as a module of computer software executing on computer hardware such as a computer processor. The compression prioritization module (314) may be executing, for example, on a storage array controller such as the storage array controllers that are described above with reference to FIG. 1 and FIG. 2.

The example method depicted in FIG. 3 also includes receiving (316) an amount of processing resources (322) available in the storage system (300). The amount of processing resources (322) available in the storage system (300) may include, for example, a number of CPU processing cycles that are available per unit of time, a percentage of the all CPU processing cycles that are available, an amount of memory that is available, and so on. The amount of processing resources (322) available in the storage system (300) may be received (316), for example, by a resource monitoring module (326) that tracks resource utilization in the system, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Readers will appreciate that the amount of processing resources (322) available in the storage system (300) may be determined based on historical information, based on the current load (e.g., the number of IOPS directed to the storage system) of the computing system (300) and the hardware resources of the computing system (300), based on any other indicia of the amount of processing resources (322) available in the storage system (300) that will occur to those of skill in the art in view of the teachings contained in this disclosure, or based on any combination thereof. As such, the amount of processing resources (322) available in the storage system (300) may be speculatively determined based on past system performance, current system performance, or any combination thereof.

The example method depicted in FIG. 3 also includes receiving (318) an amount of space (324) available in the storage system (300). The amount of space (324) available in the storage system (300) can represent the cumulative amount of available storage on the storage devices (302, 304, 306) in the storage system (300). The amount of space (324) available in the storage system (300) may be received (318) by the compression prioritization module (314), for example, by a resource monitoring module (326) that tracks resource utilization in the system, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300).

Readers will appreciate that the amount of space (324) available in the storage system (300) is distinct from the amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300). The amount of space (324) available in the storage system (300) represents the amount of long-term, persistent storage that is available within the storage devices (302, 304, 306) that are included in the storage system (300). The amount of space (324) that is available in the storage system (300) may include not only space that is available in the traditional sense, but also space that is currently in use but may be reclaimed through the use of one or more data reduction techniques such as garbage collection. In contrast to the amount of space (324) available in the storage system (300), the amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300) represents short-term, possibly volatile, memory that is available for use in performing data compression operations. The amount of available memory that may be included as part of the amount of processing resources (322) available in the storage system (300) may be embodied, for example, as DRAM within a storage array controller such as the storage array controllers described above with reference to FIG. 1 and FIG. 2. Readers will appreciate that when a user of the storage system (300) initiates a request to write data, the data will ultimately be stored within the long-term, persistent storage that is available within the storage devices (302, 304, 306), not within the short-term, possibly volatile, memory that is available for use in performing data compression operations.

The example method depicted in FIG. 3 also includes selecting (320), in dependence upon a priority for conserving the amount of processing resources and the amount of space, a data compression algorithm (328) to utilize to compress the data (308, 310, 312). Examples of data compression algorithms (328) that may be utilized to compress the data can include Lempel-Ziv algorithms, Burrows-Wheeler transform algorithms, dictionary coder algorithms, and many others. The priority for conserving the amount of processing resources and the amount of space may be embodied, for example, as a quantifiable value that represents a preference for conserving processing resources relative to conserving storage resources. For example, the priority may be a level, percentage, or a number representing a balance between processing resources and space. If the priority is determined to be biased towards better utilization of processing resources then a compression algorithm which achieves this outcome will be selected. In this scenario, the amount of space may or may not be optimal in order to receive better utilization of processing resources. If the priority is determined to be biased towards better allocation of space then similarly a compression algorithm will be selected. In this scenario, the amount of processing resources may not be optimal at times and may also vary. In some circumstances, a proportional optimization or balance between the amount of processing resources and amount of space is desired. The priority is placed on achieving an objective towards conserving both processing resources and space. In all of these scenarios, one or more compression algorithms may be selected over a period of time. Conservation of processing resources and space could be embodied as improvements to usage (e.g. less compute, memory, etc.), better utilization (e.g. use of less space, balanced usage of processors, etc.), more efficient use of energy, and performance.

Such a priority may be dynamic as the value changes over time and such a priority may be calculated based on additional factors and could change at different times. For example, one factor that impacts the priority may be the current operating conditions of the system (e.g., processing resources currently available in the storage system, the amount of space currently available in the storage system, the rate at which consumption of each type of resource is accelerating or decelerating), another factor that impacts the priority may be historical operating conditions of the system (e.g., times and dates at which consumption of each type of resource spikes or decreases), another factor that impacts the priority could be system settings (e.g., a general preference to run out of processing resources rather than storage resources, or vice versa), and so on.

In the example method depicted in FIG. 3, selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon a priority for conserving the amount of processing resources and the amount of space may be carried out, for example, by applying one or more predetermined formulas that utilizes a priority for conserving the amount of processing resources and the amount of space as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (320).

Readers will appreciate that the predetermined formula may be configured to strike a balance between the amount of processing resources (322) available in the storage system (300) and the amount of space (324) available in the storage system. For example, when the amount of processing resources (322) available in the storage system (300) are relatively low, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) utilizing quick, lightweight compression algorithms that consume relatively small amounts of computing resources and also produce relatively small amounts of data reduction. Alternatively, when the amount of processing resources (322) available in the storage system (300) are relatively large, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction. When the amount of space (324) available in the storage system is relatively low, however, the compression prioritization module (314) may select (320) to compress the data (308, 310, 312) using slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction, as a premium will be placed on data reduction rather than conservation of processing resources in such situations. Alternatively, when the amount of space (324) available in the storage system is relatively high, a premium will be placed conserving processing resources rather than data reduction in such situations.

For further explanation, FIG. 4 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 4 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 4 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

The example method depicted in FIG. 4 also includes determining (402) an expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time. The compression prioritization module (314) of FIG. 4 may determine (402) an expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time, for example, through the use of historical utilization information. If the compression prioritization module (314) analyzes historical utilization information to determine, for example, that 30 GB of storage within the storage system (300) has been consumed within the last 30 days, the compression prioritization module (314) may determine that users of the storage system (300) will continue to consume storage within the storage system (300) at a rate of 1 GB/day. In such a way, the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be determined (402) by multiplying the rate at which storage within the storage system (300) has been consumed by the predetermined period of time. The compression prioritization module (314) may additionally be configured to identify trends in usage (e.g., that the rate at which storage is being consumed is increasing or decreasing at a specific rate) and may therefore factor such trends into such a determination (402). Readers will appreciate that determining (402) the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be carried out in additional ways utilizing historical information, real-time data, or any combination thereof.

In the example method depicted in FIG. 4, determining (402) the expected amount of space (404) in the storage system (300) to be consumed within a predetermined period of time may be carried out by the compression prioritization module (314) receiving one or more messages describing the utilization of storage space within the storage system (300). The one or more messages describing the utilization of storage space within the storage system (300) may be received, for example, from a resource monitoring module (326) that tracks storage utilization in the storage system (300) or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the utilization of storage space within the storage system (300) may be tracked by the compression prioritization module (314) itself.

In the example method depicted in FIG. 4, the data compression algorithm (328) to utilize is further selected (406) in dependence upon the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time. Selecting (406) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (406).

Readers will appreciate that when the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time is relatively high, a data compression algorithm that can achieve higher levels of data reduction may be selected (406) even if such a data compression algorithm consumes relatively large amounts of processing resources, given that the available storage within the storage system (300) is being rapidly consumed. Alternatively, when the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time is relatively low, a data compression algorithm that consumes relatively small amounts of processing resources may be selected (406) even if such a data compression algorithm only achieves relatively small levels of data reduction, given that the available storage within the storage system (300) is not being rapidly consumed. In such a way, data compression algorithms that achieve higher levels of data reduction may be selected (406) as the expected amount of space (404) in the storage system (300) to be consumed within the predetermined period of time increases, even if selecting such data compression algorithms requires a larger amount of processing resources to execute relative to data compression algorithms that achieve lower levels of data reduction.

For further explanation, FIG. 5 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 5 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 5 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

The example method depicted in FIG. 5 also includes determining (502), for each of a plurality of data compression algorithms, an expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm. The compression prioritization module (314) of FIG. 5 may determine (502) an expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data. If the compression prioritization module (314) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm requires 10,000 processing cycles to compress 1 GB of data, that a second compression algorithm requires 15,000 processing cycles to compress 1 GB of data, and that a third compression algorithm requires 25,000 processing cycles to compress 1 GB of data. In such a way, the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (402) by multiplying the rate at which processing resources are historically used to compress data by the amount of data to be compressed.

In the example method depicted in FIG. 5, determining (502) the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical performance of each data compression algorithm. The one or more messages describing the historical performance of each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical performance of each data compression algorithm may be tracked by the compression prioritization module (314) itself.

In the example method depicted in FIG. 5, the data compression algorithm (328) to utilize is further selected (506) in dependence upon the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm. Selecting (506) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing the data compression algorithm as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (506).

Readers will appreciate that when the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing a particular data compression algorithm is relatively high, such a data compression algorithm may only be selected (506) when the amount of processing resources (322) available in the storage system (300) is also relatively high, in order to avoid performing resource intensive compression when other consumers of processing resources are demanding a relatively high amount of processing resources. Alternatively, when the expected amount of processing resources (504) to be consumed by compressing the data (308, 310, 312) utilizing a particular data compression algorithm is relatively low, such a data algorithm may be selected (506) even when the amount of processing resources (322) available in the storage system (300) is relatively low, as performing such data compression is less likely to prevent other consumers of processing resources from accessing such processing resources. In such a way, data compression algorithms may be selected such that performing data compression does not cause other consumers of processing resources to be blocked from accessing such processing resources.

For further explanation, FIG. 6 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 6 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 6 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

The example method depicted in FIG. 6 also includes determining (602), for each of a plurality of data compression algorithms, an expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm. The compression prioritization module (314) of FIG. 6 may determine (602) an expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm, for example, through the use of historical information gathered when previously compressing data. If the compression prioritization module (314) analyzes historical information gathered when previously compressing data to determine, for example, that a first compression algorithm historically achieves a data compression rate of 3:1, that a second compression algorithm historically achieves a data compression rate of 5:1, and that a third compression algorithm historically achieves a data compression rate of 8:1. In such a way, the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (602) by assuming that the amount of data to be compressed will be reduced in a manner that is consistent with the historical data compression rate achieved by the data compression algorithm.

In the example method depicted in FIG. 6, determining (602) the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical data compression rate achieved by each data compression algorithm. The one or more messages describing the historical data compression rate achieved by each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical data compression rate achieved by each data compression algorithm may be tracked by the compression prioritization module (314) itself.

In the example method depicted in FIG. 6, the data compression algorithm (328) to utilize is further selected (606) in dependence upon the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm. Selecting (606) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out, for example, by applying one or more predetermined formulas that utilizes the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (606).

Readers will appreciate that when the expected amount of data reduction (604) to be achieved by compressing the data (308, 310, 312) utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (606) when the amount of free space within the storage system (300) is relatively low, even if executing such a data compression algorithm consumes relatively large amounts of processing resources. Alternatively, when the amount of free space within the storage system (300) is relatively high, less emphasis may be placed on selecting (606) a data compression algorithm whose expected amount of data reduction (604) is relatively high.

For further explanation, FIG. 7 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 7 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 7 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

The example method depicted in FIG. 7 also includes determining (702), for each of a plurality of data compression algorithms, an expected decompression speed (704) associated with decompressing the data (308, 310, 312). The compression prioritization module (314) of FIG. 7 may determine (702) the expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm, for example, by identifying attributes of the data (308, 310, 312) and analyzing historical information gathered when previously decompressing data with similar attributes. The attributes of the data can include information such as, for example, the type of application that initially wrote the data (308, 310, 312) to the storage system (300), the size of the data (308, 310, 312), and so on. In such a way, the expected decompression speed (704) associated with decompressing the data (308, 310, 312) is specific to the actual data (308, 310, 312) stored on the storage system (300). The expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm may be determined (702) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for similar data.

In the example method depicted in FIG. 7, determining (702) the expected decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data. The one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical decompression speed achieved by each data compression algorithm for different types of data may be tracked by the compression prioritization module (314) itself.

In the example method depicted in FIG. 7, the data compression algorithm (328) to utilize is further selected (706) in dependence upon the decompression speed (704) associated with decompressing the data (308, 310, 312). Selecting (706) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the decompression speed (704) associated with decompressing the data (308, 310, 312) may be carried out, for example, by applying one or more predetermined formulas that utilizes the decompression speed (704) associated with decompressing the data (308, 310, 312) as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (706).

Readers will appreciate that when the decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (706) for data stored by applications that require relatively fast response times, even if utilizing such a data compression algorithm may result in relatively low levels of data reduction. Alternatively, data stored by applications that do not require relatively fast response times may be compressed utilizing data compression algorithms that deliver relatively high levels of data reduction, data compression algorithm that consume relatively low amounts of processing resources, and so on, even when the decompression speed (704) associated with decompressing the data (308, 310, 312) utilizing the data compression algorithm is relatively low.

For further explanation, FIG. 8 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 8 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 8 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

The example method depicted in FIG. 8 also includes determining (802), for each of a plurality of data compression algorithms, an average decompression speed (804) associated with decompressing a pool of data. The compression prioritization module (314) of FIG. 8 may determine (802) the average decompression speed (804) associated with decompressing a pool of data, for example, by analyzing historical information gathered when previously decompressing data. In such a way, the average decompression speed (804) associated with decompressing a pool of data is not specific to the actual data (308, 310, 312) stored on the storage system (300). The average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm may be determined (802) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for the data compression algorithm.

In the example method depicted in FIG. 8, determining (802) average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm. The one or more messages describing the historical decompression speed achieved by each data compression algorithm may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300). Alternatively, the historical decompression speed achieved by each data compression algorithm may be tracked by the compression prioritization module (314) itself.

In the example method depicted in FIG. 8, the data compression algorithm (328) to utilize is further selected (806) in dependence upon the average decompression speed (804) associated with decompressing a pool of data. Selecting (806) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the average decompression speed (804) associated with decompressing a pool of data may be carried out, for example, by applying one or more predetermined formulas that utilizes the average decompression speed (804) associated with decompressing a pool of data as an input. Such predetermined formulas may be utilized, for example, to generate a score for each available data compression algorithm, where the data compression algorithm with the lowest or highest score (depending on the particular construction of the predetermined formulas) is ultimately selected (806).

Readers will appreciate that when the average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm is relatively high, such a data compression algorithm may be selected (806) for data stored by applications that require relatively fast response times, even if utilizing such a data compression algorithm may result in relatively low levels of data reduction. Alternatively, data stored by applications that do not require relatively fast response times may be compressed utilizing data compression algorithms that deliver relatively high levels of data reduction, data compression algorithm that consume relatively low amounts of processing resources, and so on, even when average decompression speed (804) associated with decompressing a pool of data utilizing the data compression algorithm is relatively low.

For further explanation, FIG. 9 sets forth a flow chart illustrating an additional example method for compressing data in dependence upon characteristics of a storage system (300) according to embodiments of the present disclosure. The example method depicted in FIG. 9 is similar to the example method depicted in FIG. 3, as the example method depicted in FIG. 9 also includes receiving (316) an amount of processing resources (322) available in the storage system (300), receiving (318) an amount of space (324) available in the storage system (300), and selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) in dependence upon the priority for conserving the amount of processing resources (322) and the amount of space (324).

In the example method depicted in FIG. 9, selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can include compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms. Compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms may be carried out, for example, by compressing the same portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms. Alternatively, compressing (902) at least a portion of the data (308, 310, 312) utilizing a plurality of data compression algorithms may be carried out by compressing a first portion of the data (308, 310, 312) utilizing a first data compression algorithm, compressing a second portion of the data (308, 310, 312) utilizing a second data compression algorithm, compressing a third portion of the data (308, 310, 312) utilizing a third data compression algorithm, and so on.

In the example method depicted in FIG. 9, selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include identifying (904) a data reduction level achieved by each data compression algorithm. Identifying (904) a data reduction level achieved by each data compression algorithm may be carried out, for example, by determining the original size of the portion of the data (308, 310, 312) that was compressed utilizing a particular data compression algorithm and also determining the size of the resultant compressed data that was produced utilizing the particular data compression algorithm. For example, if the original size of the portion of the data (308, 310, 312) that was compressed utilizing a first data compression algorithm was 1 MB and the size of the resultant compressed data that was produced utilizing the first data compression algorithm was 0.2 MB, the data reduction level achieved by the first data compression algorithm would be 5:1. Such a calculation may be made for each data compression algorithm that was utilized to compress (902) at least a portion of the data (308, 310, 312), such that the data reduction level achieved by each data compression algorithm may be identified (904).

In the example method depicted in FIG. 9, selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include determining (906) an expected decompression speed associated with each data compression algorithm. The compression prioritization module (314) of FIG. 9 may determine (906) the expected decompression speed associated with each data compression algorithm, for example, by identifying attributes of the data (308, 310, 312) and analyzing historical information gathered when previously decompressing data with similar attributes. The attributes of the data can include information such as, for example, the type of application that initially wrote the data (308, 310, 312) to the storage system (300), the size of the data (308, 310, 312), and so on. In such a way, the expected decompression speed associated with each data compression algorithm may be specific to the actual data (308, 310, 312) stored on the storage system (300). The expected decompression speed associated with each data compression algorithm may be determined (904) by assuming that the data (308, 310, 312) will be decompressed at a speed that is consistent with the historical decompression speed for similar data.

In the example method depicted in FIG. 9, determining (906) an expected decompression speed associated with each data compression algorithm may be carried out by the compression prioritization module (314) receiving one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data. The one or more messages describing the historical decompression speed achieved by each data compression algorithm for different types of data may be received, for example, from a resource monitoring module (326) that tracks the performance of various compression algorithms, by the compression prioritization module (314) itself, or by any other module that is included in the storage system (300) or operable to otherwise manage the storage system (300).

In the example method depicted in FIG. 9, selecting (320) a data compression algorithm (328) to utilize to compress the data (308, 310, 312) can also include selecting (908) the data compression algorithm to utilize to compress the data (308, 310, 312) in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm. Selecting (908) the data compression algorithm to utilize to compress the data (308, 310, 312) in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm may be carried out, for example, by applying a predetermined formula that utilizes the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm as inputs. Readers will appreciate that the predetermined formula may be configured to strike a balance between the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm. For example, when the amount of space (324) available in the storage system is relatively low, the compression prioritization module (314) may select (908) to compress the data (308, 310, 312) using slower, heavier compression algorithms that consume relatively large amounts of computing resources and also produce relatively large amounts of data reduction, as a premium will be placed on data reduction rather than conservation of processing resources as the amount of space available in the storage system is reduced. Alternatively, when the amount of space (324) available in the storage system is relatively high, a premium may be placed increasing response times to I/O operations and, as such, data compression algorithms that achieve faster decompression speeds may be selected (908).

In the example embodiments described above, a data compression algorithm (328) to utilize to compress data (308, 310, 312) is selected (320) based on factors such as (but not limited to): the priority for conserving the amount of processing resources (322) and the amount of space (324); the amount of processing resources available in the storage system; the amount of space available in the storage system; the expected amount of space in the storage system to be consumed within a predetermined period of time; the expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm; the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; the expected decompression speed associated with decompressing the data; and the average decompression speed associated with decompressing a pool of data. While the example embodiments described above typically describe selecting a data compression algorithm (328) to utilize to compress data (308, 310, 312) based on only a small subset of such factors, such a description is included only for ease of explanation. Readers will appreciate that embodiments are contemplated where a data compression algorithm (328) to utilize to compress data (308, 310, 312) is selected (320) based on combinations of factors not expressly identified above, including utilizing all of the factors described above to select a data compression algorithm (328) to utilize to compress data (308, 310, 312). In fact, such factors may be given equal or unequal consideration in various embodiments of the present disclosure. Furthermore, a data compression algorithm (328) to utilize to compress data (308, 310, 312) may be selected (320) in further dependence on additional factors as will occur to those of skill in the art in view of the present disclosure.

Example embodiments of the present disclosure are described largely in the context of a fully functional computer system. Readers of skill in the art will recognize, however, that the present disclosure also may be embodied in a computer program product disposed upon computer readable media for use with any suitable data processing system. Such computer readable storage media may be any transitory or non-transitory media. Examples of such media include storage media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media also include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a computer program product. Persons skilled in the art will recognize also that, although some of the example embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware, as hardware, or as an aggregation of hardware and software are well within the scope of embodiments of the present disclosure.

It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present disclosure without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present disclosure is limited only by the language of the following claims. 

What is claimed is:
 1. A method comprising: identifying an amount of processing resources available in a storage system; identifying an amount of space available to store additional data in the storage system; selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space available to store additional data, a data compression algorithm to utilize to compress the data; detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed; and responsive to detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed, selecting a different data compression algorithm to utilize to compress data.
 2. The method of claim 1 further comprising: determining an expected amount of space in the storage system to be consumed within a predetermined period of time; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of space in the storage system to be consumed within the predetermined period of time.
 3. The method of claim 1 further comprising: determining, for each of a plurality of data compression algorithms, an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm.
 4. The method of claim 1 further comprising: determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
 5. The method of claim 1 further comprising: determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
 6. The method of claim 1 further comprising: determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data.
 7. The method of claim 1 wherein selecting the data compression algorithm to utilize to compress the data further comprises: compressing at least a portion of the data utilizing a plurality of data compression algorithms; identifying a data reduction level achieved by each data compression algorithm; determining a decompression speed associated with each data compression algorithm; and selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm.
 8. An apparatus, the apparatus including a computer processor and a computer memory, the computer memory including computer program instructions that, when executed, cause the apparatus to carry out the steps of: identifying an amount of processing resources available in a storage system; identifying an amount of space available to store additional data in a storage system; selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space available to store additional data, a data compression algorithm to utilize to compress the data; detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed; and responsive to detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed, selecting a different data compression algorithm to utilize to compress data.
 9. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining an expected amount of space in the storage system to be consumed within a predetermined period of time; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of space in the storage system to be consumed within the predetermined period of time.
 10. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm.
 11. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
 12. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
 13. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data.
 14. The apparatus of claim 8 wherein selecting the data compression algorithm to utilize to compress the data further comprises: compressing at least a portion of the data utilizing a plurality of data compression algorithms; identifying a data reduction level achieved by each data compression algorithm; determining a decompression speed associated with each data compression algorithm; and selecting the data compression algorithm to utilize to compress the data in dependence upon the data reduction level achieved by each data compression algorithm and the decompression speed associated with each data compression algorithm.
 15. A computer program product, the computer program product disposed on a non-transitory computer readable storage medium, the computer program product comprising computer program instructions that, when executed, cause an apparatus to carry out the steps of: identifying an amount of processing resources available in a storage system; identifying an amount of space available to store additional data in the storage system; selecting, in dependence upon a priority for conserving the amount of processing resources and the amount of space available to store additional data, a data compression algorithm to utilize to compress the data; detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed; and responsive to detecting that at least one of the amount of processing resources available in the storage system or the amount of space available to store additional data in the storage system has changed, selecting a different data compression algorithm to utilize to compress data.
 16. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining an expected amount of space in the storage system to be consumed within a predetermined period of time; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of space in the storage system to be consumed within the predetermined period of time.
 17. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of processing resources to be consumed by compressing the data utilizing the data compression algorithm.
 18. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected amount of data reduction to be achieved by compressing the data utilizing the data compression algorithm.
 19. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an expected decompression speed associated with decompressing the data; and wherein the data compression algorithm to utilize is further selected in dependence upon the expected decompression speed associated with decompressing the data.
 20. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: determining, for each of a plurality of data compression algorithms, an average decompression speed associated with decompressing a pool of data; and wherein the data compression algorithm to utilize is further selected in dependence upon the average decompression speed associated with decompressing a pool of data. 